|
In computational complexity theory, NP is one of the most fundamental complexity classes. The abbreviation NP refers to "nondeterministic polynomial time." Intuitively, NP is the set of all decision problems for which the instances where the answer is "yes" have efficiently verifiable proofs of the fact that the answer is indeed "yes". More precisely, these proofs have to be ''verifiable'' in polynomial time by a deterministic Turing machine. In an equivalent formal definition, NP is the set of decision problems where the "yes"-instances can be accepted in polynomial time by a non-deterministic Turing machine. The equivalence of the two definitions follows from the fact that an algorithm on such a non-deterministic machine consists of two phases, the first of which consists of a guess about the solution, which is generated in a non-deterministic way, while the second consists of a deterministic algorithm that verifies or rejects the guess as a valid solution to the problem.〔Alsuwaiyel, M. H.: ''Algorithms: Design Techniques and Analysis'', (p. 283 )〕 The complexity class P is contained in NP, but NP contains many important problems, the hardest of which are called NP-complete problems, whose solutions are sufficient to deal with any other NP problem in polynomial time. The most important open question in complexity theory, the P = NP problem, asks whether polynomial time algorithms actually exist for NP-complete, and by corollary, all NP problems. It is widely believed that this is not the case. == Formal definition == The complexity class NP can be defined in terms of NTIME as follows: : Alternatively, NP can be defined using deterministic Turing machines as verifiers. A language ''L'' is in NP if and only if there exist polynomials ''p'' and ''q'', and a deterministic Turing machine ''M'', such that * For all ''x'' and ''y'', the machine ''M'' runs in time ''p''(|''x''|'')'' on input ''(x,y)'' * For all ''x'' in ''L'', there exists a string ''y'' of length ''q''(|''x''|) such that ''M(x,y)'' = 1 * For all ''x'' not in ''L'' and all strings ''y'' of length ''q''(|''x''|), ''M(x,y)'' = 0 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「NP (complexity)」の詳細全文を読む スポンサード リンク
|